Sign in
Facet browsing currently unavailable
Page 1 of 43 results
Sort by: relevance publication year
|
Two classes of graphs in which some problems related to convexity are efficiently solvable JOURNAL ARTICLE published June 2018 in Discrete Mathematics, Algorithms and Applications |
|
CHARACTERISTIC PROPERTIES AND RECOGNITION OF GRAPHS IN WHICH GEODESIC AND MONOPHONIC CONVEXITIES ARE EQUIVALENT JOURNAL ARTICLE published December 2012 in Discrete Mathematics, Algorithms and Applications |
|
The bipartite margin shop and maximum red matchings free of blue–red alternating cycles JOURNAL ARTICLE published August 2009 in Discrete Optimization |
|
A fast parallel algorithm for finding Hamiltonian cycles in dense graphs JOURNAL ARTICLE published April 2009 in Discrete Mathematics |
|
On the Universal Partition Theorem for 4-Polytopes JOURNAL ARTICLE published April 1998 in Discrete & Computational Geometry |
|
Query optimization and processing in parallel databases BOOK CHAPTER published 12 July 1995 in Parallel Processing of Discrete Optimization Problems |
|
A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions JOURNAL ARTICLE published August 2009 in Discrete Optimization |
|
A fast algorithm for strongly correlated knapsack problems JOURNAL ARTICLE published December 1998 in Discrete Applied Mathematics |
|
Fast Algorithms for Complete Linkage Clustering JOURNAL ARTICLE published January 1998 in Discrete & Computational Geometry |
|
A fast parallel algorithm to recognize P4-sparse graphs JOURNAL ARTICLE published January 1998 in Discrete Applied Mathematics |
|
An Optimal Algorithm for Closest-Pair Maintenance JOURNAL ARTICLE published February 1998 in Discrete & Computational Geometry |
|
Geometric Lower Bounds for Parametric Matroid Optimization JOURNAL ARTICLE published December 1998 in Discrete & Computational Geometry |
|
Fast Domino Tileability JOURNAL ARTICLE published September 2016 in Discrete & Computational Geometry |
|
The JOURNAL ARTICLE published December 2005 in Discrete Optimization |
|
A Fast Shortest Path Algorithm on Terrain-like Graphs JOURNAL ARTICLE published September 2021 in Discrete & Computational Geometry Research funded by Deutsche Forschungsgemeinschaft (NI 369/17-1) |
|
A polynomial algorithm for the two-connections variant of the tree JOURNAL ARTICLE published November 2014 in Discrete Optimization |
|
A fast las vegas algorithm for triangulating a simple polygon JOURNAL ARTICLE published October 1989 in Discrete & Computational Geometry |
|
An algorithm for finding a maximum JOURNAL ARTICLE published May 2012 in Discrete Optimization |
|
A simple algorithm for finding a maximum triangle-free JOURNAL ARTICLE published November 2010 in Discrete Optimization |
|
An improved algorithm for computing Steiner minimal trees in Euclidean JOURNAL ARTICLE published May 2008 in Discrete Optimization |
![Cite](javascript:showCiteBox("10.1016/j.disopt.2005.08.004", "The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi>S</mml:mi></mml:math>-digraph optimization problem and the greedy algorithm");){kind=link}
![Cite](javascript:showCiteBox("10.1016/j.disopt.2014.06.001", "A polynomial algorithm for the two-connections variant of the tree <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si13.gif" display="inline" overflow="scroll"><mml:mi>p</mml:mi></mml:math>-median problem");){kind=link}
![Cite](javascript:showCiteBox("10.1016/j.disopt.2012.02.003", "An algorithm for finding a maximum <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si11.gif" display="inline" overflow="scroll"><mml:mi>t</mml:mi></mml:math>-matching excluding complete partite subgraphs");){kind=link}
![Cite](javascript:showCiteBox("10.1016/j.disopt.2010.04.001", "A simple algorithm for finding a maximum triangle-free <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mn>2</mml:mn></mml:math>-matching in subcubic graphs");){kind=link}
![Cite](javascript:showCiteBox("10.1016/j.disopt.2007.08.006", "An improved algorithm for computing Steiner minimal trees in Euclidean <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si6.gif" display="inline" overflow="scroll"><mml:mi>d</mml:mi></mml:math>-space");){kind=link}